Traces Without Maximal Chains

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Traces Without Maximal Chains

The trace of a family of sets A on a set X is A|X = {A ∩ X : A ∈ A}. If A is a family of k-sets from an n-set such that for any r-subset X the trace A|X does not contain a maximal chain, then how large can A be? Patkós conjectured that, for n sufficiently large, the size of A is at most ( n−k+r−1 r−1 ) . Our aim in this paper is to prove this conjecture.

متن کامل

On Traces of Maximal Clones

In this paper we study the partially ordered set of endomorphism monoids of Rosenberg relations, which are used to characterize maximal clones on a finite set. The problem naturally splits into 49 cases of interrelationships of endomorphism monoids of Rosenberg relations. In order to make the paper self-contained, in addition to new results, we survey some previously published partial results p...

متن کامل

The number of maximal matchings in polyphenylene chains

A matching is maximal if no other matching contains it as a proper subset. Maximal matchings model phenomena across many disciplines, including applications within chemistry. In this paper, we study maximal matchings in an important class of chemical compounds: polyphenylenes. In particular, we determine the extremal polyphenylene chains in regards to the number of maximal matchings. We also de...

متن کامل

Computing maximal chains

In [Wol67], Wolk proved that every well partial order (wpo) has a maximal chain; that is a chain of maximal order type. (Note that all chains in a wpo are well-ordered.) We prove that such maximal chain cannot be found computably, not even hyperarithmetically: No hyperarithmetic set can compute maximal chains in all computable wpos. However, we prove that almost every set, in the sense of categ...

متن کامل

Addendum to “ Maximal Chains In

This note is intended as a supplement and clarification to the proof of Theorem 3.3 of [1]; namely, it is consistent that b = ℵ 1 yet for every ultrafilter U on ω there is a ≤ * chain {f ξ : ξ ∈ ω 2 } such that {f ξ /U : ξ ∈ ω 2 } is cofinal in ω/U. The general outline of the the proof remains the same. In other words, a ground model is taken which satisfies 2 ℵ0 = ℵ 1 and in which there is a ♦...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Electronic Journal of Combinatorics

سال: 2010

ISSN: 1077-8926

DOI: 10.37236/465